Exploiting Matrix Sparsity for Symbolic Analysis
نویسندگان
چکیده
This paper deals with a method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits. The method is based on a simplification of the equations of circuit models of linear or linearized circuits in the frequency domain. The simplified model is then analyzed symbolically. The algorithm proposed has been developed with the aim of obtaining maximum computational efficiency. Key-Words: Approximate symbolic analysis, linear circuits, circuit decomposition
منابع مشابه
Hierarchical Symbolic Analysis of Large Analog Circuits with Determinant Decision Diagrams
A novel hierarchical approach is proposed to symbolic analysis of large analog circuits. The key idea is to use a graph-based representation—called Determinant Decision Diagram (DDD)— to represent the symbolic determinant and cofactors associated with the MNA matrix for each subcircuit block. By exploiting the inherent sharing and sparsity of symbolic expressions, DDD is capable of representing...
متن کاملExploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Abstract A basic framework for exploiting sparsity via positive semidefinite matrix completion is presented for an optimization problem with linear and nonlinear matrix inequalities. The sparsity, characterized with a chordal graph structure, can be detected in the variable matrix or in a linear or nonlinear matrix-inequality constraint of the problem. We classify the sparsity in two types, the...
متن کاملCanonical symbolic analysis of large analog circuits withdeterminant decision diagrams
Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. I...
متن کاملSymbolic-Numeric Efficient Solution of Optimal Control Problems for Multibody Systems
This paper presents an efficient symbolic-numerical approach for generating and solving the Boundary Value Problem Differential Algebraic Equation (BVP-DAE) originating from the variational form of the Optimal Control Problem (OCP). This paper presents the Method for the symbolic derivation, by means of symbolic manipulation software (Maple), of the equations of the OCP applied to a generic mul...
متن کاملSparsity optimized high order finite element functions on simplices
This article reports several results on sparsity optimized basis functions for hp-FEM on triangular and tetrahedral finite element meshes obtained within the Special Research Program “Numerical and Symbolic Scientific Computing” and within the Doctoral Program “Computational Mathematics” both supported by the Austrian Science Fund FWF under the grants SFB F013 and DK W1214, respectively. We giv...
متن کامل